In this paper, a method to initiate, develop and visualize an abstract syntax\ntree (AST) in C++ source code is presented. The approach is in chronological\norder starting with collection of program codes as a string and split into individual\ncharacters using regular expression. This will be followed by separating\nthe token grammar using best first search (BFS) algorithm to determine node\nhaving lowest value, lastly followed by graph presentation of intermediate representation\nachieved with the help of graph visualization software (Graph-\nViz) while former is implemented using python programming language version\n3. The efficacy of our approach is used in analyzing C++ code and\nyielded a satisfactory result.
Loading....